Fast asynchronous systems in dense time
نویسندگان
چکیده
منابع مشابه
Fast Asynchronous Systems in Dense Time
A testing scenario in the sense of De Nicola and Hennessy is developed to measure the worst-case eeciency of asynchronous systems using dense time. For all three variants considered, it is shown that one can equivalently use discrete time; in the discrete versions, one variant coincides with an approach based on discrete time in Vog95b], and thus we can clarify the assumptions behind this appro...
متن کاملFast Asynchronous Uniform Consensus in Real-Time Distributed Systems
We investigate whether asynchronous computational models and asynchronous algorithms can be considered for designing real-time distributed fault-tolerant systems. A priori, the lack of bounded finite delays is antagonistic with timeliness requirements. We show how to circumvent this apparent contradiction, via the principle of “late binding” of a solution to some (partially) synchronous model. ...
متن کاملUniversit at Augsburg Modular Construction of Fast Asynchronous Systems Modular Construction of Fast Asynchronous Systems
A testing scenario in the sense of De Nicola and Hennessy is developed to measure the worst-case eeciency of asynchronous systems using dense time, and it is shown that one can equivalently use discrete time. The resulting testing-preorder is characterized with some kind of refusal traces. Furthermore, the testing-preorder is reened to a precongruence for standard operators known from process a...
متن کاملAsynchronous Real-time Systems
A goal of the Iligl)t Sys(cm ‘[ ’cs(bd (1 ’S’1 ’ ) is 10 gcmrdlim and opt im im system-level spacecraft in[crfaccs in suppor( of mpid prototypit~g a n d intcgta[ion testins [ l;S’l’, [’194]. Using software 10 simulate the spacccrdft and environment al arbitrary levels of abstraction is lhc Illcmc oftbis paper. A snapshot of a spacccmfi under clcvclopmmt includes a combination o f barciwarc cagi...
متن کاملFast Solvers for Dense Linear Systems
It appears that large scale calculations in particle physics often require to solve systems of linear equations with rational number coefficients exactly. If classical Gaussian elimination is applied to a dense system, the time needed to solve such a system grows exponentially in the size of the system. In this tutorial paper, we present a standard technique from computer algebra that avoids th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2001
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(99)00304-7